Multi-Objective Vehicle Routing Problem for a Mixed Fleet of Electric and Conventional Vehicles with Time Windows and Recharging Stations

The vehicle routing problem as a challenging decision has been studied extensively. More specifically, solving it for mixed fleet requires realistic calculation of the performance electric and combustion vehicles. This study addresses new variant vehicles under presence time windows charging stations. A bi-objective mixed-integer programming model is developed which aims at minimizing cost pollution level concurrently. To accurately quantify travel quantities, such fuel consumption, emission, battery charge level, set mathematical formulas are used. first converted to single-objective counterpart using epsilon-constraint method simulated annealing algorithm tailored obtain Pareto optimal solutions. discussion also made on how final solution can be selected from frontier according design objectives. presented framework find solutions trade-off between objectives by considering different combinations It was shown that those involve more than fleet, lead higher total costs smaller emissions vice versa.